//https://leetcode.cn/problems/unique-paths-ii/submissions/560515118/

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        //1.创建dp表
        //2.初始化
        //3.填表
        //4.返回值

        int m = obstacleGrid.size(), n = obstacleGrid[0].size();

        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        dp[0][1] = 1;

        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (obstacleGrid[i - 1][j - 1] != 1)
                {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }

        return dp[m][n];

    }
};